• TPLP regular papers
• Transactions On Computational Logic (TOCL) regular papers

• Epistemic Foundation of Stable Model Semantics, Yann Loyer and Umberto Straccia. pp 355-393
  
• Computing minimal models, stable models and answer sets, Zbigniew Lonc and Miroslaw Truszczynski. pp 395-449
  
• EPspectra: A Formal Toolkit for Developing DSP Software Applications,Hahnsang Kim, Thierry Turletti, Amar Bouali. pp 451-481
  

• Programming Finite-Domain Constraint Propagators in Action Rules, Neng-Fa Zhou. pp 483-508
  
• A three-valued semantics for logic programmers, Lee Naish. pp 509-538
  
• Temporal Phylogenetic Networks and Logic Programming, Esra Erdem, Vladimir Lifschitz, and Don Ringe. pp 539-558
  
• Planning with Preferences using Logic Programming, Tran Cao Son and Enrico Pontelli. pp 559-608
  

Special Issues (to appear)

• Introduction to the special issue on multiparadigm languages and constraint programming, Moreno Falaschi and Michael Maher,
• Mapping fusion and synchronized hyperedge replacement into logic programming, Ivan Lanese and Ugo Montanari
• A comparison between two logical formalisms for rewriting, Miguel Palomino
• Combining relational algebra, SQL, constraint modelling, and local search, Marco Cadoli and Toni Mancini,
• Constraint-based automatic verification of abstract models of multitreaded programs, Giorgio Delzanno
• Removing redundant arguments automatically, Maria Alpuente, Santiago Escobar, and Salvador Lucas,
• Forward slicing of functional logic programs by partial evaluation, Josep Silva and German Vidal,
• Demand Analysis with Partial Predicates, Julio Marino, Angel Herranz and Juan Jose Moreno-Navarro
• Integration of Declarative and Constraint Programming, Petra Hofstedt and Peter Pepper

Accepted Regular Papers

• Set Unification, Agostino Dovier, Enrico Pontelli, and Gianfranco Rossi.
  
• Improving PARMA Trailing, Tom Schrijvers, Maria Garcia de la Banda, Bart Demoen, Peter J. Stuckey
  
• Incremental copying garbage collection for WAM-based Prolog systems, Ruben Vandeginste, Bart Demoen.
  
• Embedding Defeasible Logic into Logic Programming, Grigoris Antoniou, David Billington, Guido Governatori and Michael J. Maher.
  
• Intelligent search strategies based on adaptive Constraint Handling Rules, Armin Wolf.
  
• A Knowledge-Based Approach for Selecting Information Sources, Thomas Eiter, Michael Fink, and Hans Tompits
  
• Constraint Functional Logic Programming over Finite Domains, Antonio J. Fernandez, Teresa Hortala-Gonzalez, Fernando Saenz-Perez and Rafael del Vado-Virseda.
  
• Reasoning and Planning with Sensing Actions, Incomplete Information, and Static Causal Laws using Answer Set Programming, Phan Huy Tu, Tran Cao Son, and Chitta Baral
  
• Well-founded and Stable Semantics of Logic Programs with Aggregates, Nikolay Pelov, Marc Denecker, and Maurice Bruynooghe
  
• PALS: Efficient or-Parallelism on Beowulf clusters, Enrico Pontelli, Karen Villaverde, Hai-Feng Guo, Gopal Gupta
  
• Decomposable Theories, Khalil Djelloul
  
• Logic programs with monotone abstract constraint atoms, Victor Marek, lkka Niemela, and Mirek Truszczynski
  
• Automated verification of weak equivalence within the smodels system, Tomi Janhunen and Emilia Oikarinen
  
• Calculating modules in contextual logic program refinement, Robert Colvin, Ian J. Hayes and Paul Strooper
  
• Updates in Answer Set Programming: An Approach Based on Basic Structural Properties, Mauricio Osorio and Victor Cuevas
  

Accepted Technical Note

• Logic programming with default, weak and strict negations, Susumu Yamasaki.
  
• Fast Frequent Querying with Lazy Control Flow Compilation, Remko Troncon, Gerda Janssens, Bart Demoen, Henk Vandecasteele
  
• A Constructive Semantic Characterization of Aggregates in Answer Set Programmino, Tran Cao Son, Enrico Pontelli
  

Accepted Programming Pearl

Accepted Book Review

• Explanatory Nonmonotonic Reasoning by Alexander Bochman World Scientific, Hardback: ISBN 981-256-101-3 Victor W. Marek
  

The files below are the final versions of the papers submitted by the authors. The definite, published versions of the papers are available from the TOCL home page within the ACM Digital Library.

Volume 7, Number 4 (October 2006)

• Domain-Dependent Knowledge in Answer Set Planning Tran Cao Son, Chitta Baral, Nam Tran, and Sheila McIlraith
• Defining Functions on Equivalence Classes Larry Paulson
• Extensional Equivalence and Singleton Types Christopher A. Stone and Robert Harper
• Efficient Solving of Quantified Inequality Constraints over the Real Numbers Stefan Ratschan
• The Strength of Replacement in Weak Arithmetic Stephen Cook and Neil Thapen
• Splitting an Operator: Algebraic Modularity Results for Logics with Fixpoint Semantics Joost Vennekens, David Gilis and Marc Denecker
• Kleene Algebra with Domain J. Desharnais, B. Möller, G. Struth

Volume 8, Number 1 (January 2007) (tentative)

• A System of Interaction and Structure Alessio Guglielmi
• Compilability of Propositional Abduction Paolo Liberatore and Marco Schaerf
• Results on the Quantitative Mu-Calculus Annabelle McIver and Carroll Morgan
• On Compositionality and its Limitations Alex Rabinovich
• Logical Characterizations of Heap Abstractions G. Yorsh, T. Reps, M. Sagiv and R. Wilhelm
• Abstract Canonical Inference Maria Paola Bonacina and Nachum Dershowitz

Volume 8, Number 2 (April 2007) (tentative)

• Sound and Complete Elimination of Singleton Kinds Karl Crary
• Recycling Computed Answers in Rewrite Systems for Abduction Fangzhen Lin and Jia-Huai You
• Where Fail-Safe Default Logics Fail Paolo Liberatore
• Logical Definability and Query Languages over Ranked and Unranked Trees M. Benedikt, L. Libkin and F. Neven
• On Unification for Bounded Distributive Lattices Viorica Sofronie-Stokkermans
• The Arithmetical Complexity of Dimension and Randomness John M. Hitchcock, Jack H. Lutz, Sebastiaan A. Terwijn

Future Issues (the order of the papers can change)

• PELCR: Parallel Environment for Optimal Lambda Calculus Reduction M. Pedicini, F. Quaglia
• Ordinary Interactive Small-Step Algorithms II Andreas Blass and Yuri Gurevich
• Ordinary Interactive Small-Step Algorithms III Andreas Blass and Yuri Gurevich
• Semantical Characterizations and Complexity of Equivalences in Answer Set Programming Thomas Eiter, Michael Fink, and Stefan Woltran (Electronic Appendix)
• Paraconsistent Reasoning and Preferential Entailments by Signed Quantified Boolean Formulae Ofer Arieli
• The Axiomatic Translation Principle for Modal Logic Renate A. Schmidt and Ullrich Hustadt
• Probabilistic Abstraction for Model Checking: An Approach Based on Property Testing Sophie Laplante, Richard Lassaigne, Frederic Magniez, Sylvain Peyronnet and Michel de Rougemont
• First-Order Queries on Structures of Bounded Degree Are Computable with Constant Delay Arnaud Durand and Etienne Grandjean
• A Sequent Calculus and a Theorem Prover for Standard Conditional Logics Nicola Olivetti, Gian Luca Pozzato and Camilla Schwind
• Removing Propagation Redundant Constraints in Redundant Modeling Chiu Wo Choi, Jimmy Ho-Man Lee and Peter J. Stuckey
• Probabilistic Interval XML Edward Hung, Lise Getoor and V.S. Subrahmanian
• A Game-Based Framework for CTL Counterexamples and 3-Valued Abstraction-Refinement Sharon Shoham and Orna Grumberg (Electronic Appendix)
• A Formally Verified Proof of the Prime Number Theorem Jeremy Avigad, Kevin Donnelly, David Gray and Paul Raff
• Polymorphic Type Inference for the Named Nested Relational Calculus Jan Van den Bussche and Stijn Vansummeren
• Predicate Abstraction with Indexed Predicates Shuvendu Lahiri and Randal Bryant
• Verifying Nondeterministic Probabilistic Channel Systems Against Omega-Regular Linear-Time Properties Christel Baier, Nathalie Bertrand and Philippe Schnoebelen
• A Concrete Framework for Environment Machines Malgorzata Biernacka and Olivier Danvy
• Outlier Detection by Logic Programming Fabrizio Angiulli, Gianluigi Greco and Luigi Palopoli (Electronic Appendix)
• A Comprehensive Combination Framework Silvio Ghilardi, Enrica Nicolini and Daniele Zucchelli
• Coordination in Answer Set Programming Chiaki Sakama and Katsumi Inoue
• Alternating Timed Automata Slawomir Lasota and Igor Walukiewicz
• Bounds on the Automata Size for Presburger Arithmetic Felix Klaedtke
• Durations and Parametric Model-Checking in Timed Automata Véronique Bruyère, Emmanuel Dall'Oli and Jean-Francois Raskin
• First-order Complete and Computationally Complete Query Languages for Spatio-Temporal Databases Sofie Haesevoets, Floris Geerts and Bart Kuijpers
• A Logic for Non-Monotone Inductive Definitions Marc Denecker and Eugenia Ternovska
• A Uniform Approach to Constraint-solving for Lists, Multisets, Compact Lists, and Sets Agostino Dovier, Carla Piazza, and Gianfranco Rossi
• Foundational Certified Code in the Twelf Metalogical Framework Karl Crary and Susmit Sarkar
• Inferring Non-Suspension Conditions for Logic Programs with Dynamic Scheduling Samir Genaim and Andy King